import javax.xml.soap.Node;

public class Dijkstra {

    public static void main(String[] args) {
            Integer n = null;
        Integer o = 1;
            boolean equals = n ==o;
            System.out.println(String.valueOf(equals));

    }

    //假设起点为src, 终点为dst, 图以二维矩阵的形式存储，若graph[i][j] == 0, 代表i,j不相连
    //visit[i] == 0,代表未访问,visit[i] == -1代表已访问
    public static Node dijkstra(int src,int dst,int[][] graph,int[] visit) {
        return null;
    }
}
